On the hardness of minimizing space for all-shortest-path interval routing schemes
نویسندگان
چکیده
منابع مشابه
On the hardness of minimizing space for all-shortest-path interval routing schemes
k-Interval Routing Scheme (k-IRS) is a compact routing method that allows up to k interval labels to be assigned to an arc; and global k-IRS allows not more than a total of k interval labels in the whole network. A fundamental problem is to characterize the networks that admit k-IRS (or global k-IRS). Many of the problems related to single-shortest-path k-IRS have already been shown to be NP-co...
متن کاملCharacterization results of all shortest paths interval routing schemes
We give complete characterizations of the classes of graphs with uniform cost links which admit optimum all shortest paths 1 ? SLIRS (Strict Linear Interval Routing Schemes) and 1 ? LIRS (Linear Interval Routing Schemes). The characterization of all the other Interval Routing Schemes with uniform cost links that represent only a single shortest path is known to be NP-Complete. We also show that...
متن کاملOn the Hardness of Finding Small Shortest Path Routing Conflicts
Nowadays most data networks use shortest path protocols such as OSPF or IS-IS to route traffic. Given administrative routing lengths for the links of a network, all data packets are sent along shortest paths with respect to these lengths from their source to their destination. One of the most fundamental problems in planning shortest path networks is to decide whether a given set of routing pat...
متن کاملLower Bounds for Shortest Path Interval Routing
Interval Routing was introduced to reduce the size of the routing tables: a router nds the direction to forward a message by determining the interval that contains the destination address of the message, each interval being associated to one particular direction. In this paper, we give lower bounds for the minimum number of intervals per edge needed to achieve shortest path routings for the cla...
متن کاملOn the Hardness of Devising Interval Routing Schemes
The k-Interval Routing Scheme (k-IRS) is a compact routing scheme on general networks. It has been studied extensively and recently been implemented on the latest generation of the INMOS transputer router chips. In this paper we investigate the time complexity of devising a minimal space k-IRS and we prove that the problem of deciding whether there exists a 2-IRS for any network G is NP-complet...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.09.010